On the Parametrization of Algebraic Discrete Fourier Transforms
نویسندگان
چکیده
Computing the Discrete Fourier Transform (DFT) of signals over some nite eld Fq often requires an extension to a large eld Fqn containing an appropriate primitive root of unity. The Algebraic Discrete Fourier Transforms (ADFTs) avoid the extension of the base eld Fq and can be used to compute the spectrum of the DFT. We derive a complete parametrization of ADFT matrices and show how this knowledge can be employed to derive VLSI realizations with low implementation complexity.
منابع مشابه
A general construction of Reed-Solomon codes based on generalized discrete Fourier transform
In this paper, we employ the concept of the Generalized Discrete Fourier Transform, which in turn relies on the Hasse derivative of polynomials, to give a general construction of Reed-Solomon codes over Galois fields of characteristic not necessarily co-prime with the length of the code. The constructed linear codes enjoy nice algebraic properties just as the classic one.
متن کاملDiscrete Transforms, Semidefinite Programming, and Sum-of-Squares Representations of Nonnegative Polynomials
Abstract. We present a new semidefinite programming formulation of sum-of-squares representations of nonnegative polynomials, cosine polynomials and trigonometric polynomials of one variable. The parametrization is based on discrete transforms (specifically, the discrete Fourier, cosine and polynomial transforms) and has a simple structure that can be exploited by straightforward modifications ...
متن کاملEfficient encoding via Gröbner bases and discrete Fourier transforms for several kinds of algebraic codes
Abstract—Novel encoding scheme for algebraic codes, such as codes on algebraic curves, multidimensional cyclic codes, and hyperbolic cascaded Reed–Solomon codes, is proposed with numerical examples. We make use of the 2-dimensional inverse discrete Fourier transform, which generalizes the Mattson–Solomon polynomial for Reed–Solomon codes. We also generalize the workings of the generator polynom...
متن کاملAlgebraic Signal Processing Theory: Cooley-Tukey Type Algorithms for Polynomial Transforms Based on Induction
A polynomial transform is the multiplication of an input vector x ∈ C by a matrix Pb;α ∈ Cn×n; whose ðk;lÞth element is defined as plðαkÞ for polynomials plðxÞ ∈ C1⁄2x from a list b 1⁄4 fp0ðxÞ; : : : ; pn−1ðxÞg and sample points αk ∈ C from a list α 1⁄4 fα0; : : : ;αn−1g. Such transforms find applications in the areas of signal processing, data compression, and function interpolation. An import...
متن کاملAlgebraic Signal Processing Theory: Cooley-Tukey Type Algorithms for Real DFTs
In this paper we systematically derive a large class of fast general-radix algorithms for various types of real discrete Fourier transforms (real DFTs) including the discrete Hartley transform (DHT) based on the algebraic signal processing theory. This means that instead of manipulating the transform definition, we derive algorithms by manipulating the polynomial algebras underlying the transfo...
متن کامل